Mathematics and Computing - PDFSEARCH.IO - Document Search Engine

Mathematics and Computing
Results: 2535

#	Item
231	ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G Add to Reading List Source URL: www.math.lsa.umich.edu Language: English - Date: 2014-08-27 10:06:40 Mathematics Permutations Linear algebra Matrix theory Algebra Permanent Computing the permanent Permutation Hamiltonian path Tournament
232	Canadian Mathematics Competition An activity of the Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario Add to Reading List Source URL: www.cemc.uwaterloo.ca Language: English - Date: 2011-12-05 14:01:38
233	COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS WITH MULTIPLICITIES ´n Alexander Barvinok and Pablo Sobero July 2015 Add to Reading List Source URL: www.math.lsa.umich.edu Language: English - Date: 2015-08-02 17:12:20 Graph theory Mathematics NP-complete problems Graph operations Graph coloring Line graph Matching Two-graph Train track map
234	Canadian Mathematics Competition An activity of the Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario Add to Reading List Source URL: www.cemc.uwaterloo.ca Language: English - Date: 2011-12-05 14:01:31
235	The CENTRE for EDUCATION in MATHEMATICS and COMPUTING ´ Le CENTRE d’EDUCATION ´ en MATHEMATIQUES Add to Reading List Source URL: www.cemc.uwaterloo.ca Language: English - Date: 2014-05-06 13:22:44
236	Destroying networks for fun (and profit) Nick Shelly∗§, Brendan Tschaen†, Klaus-Tycho Förster∗, Michael Chang‡, Theophilus Benson†, Laurent Vanbever∗ ∗ ETH Zürich, ‡Princeton University, †Duke Unive Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-10-22 14:59:53 Graph connectivity Emerging technologies Network architecture SIGCOMM Software-defined networking Stress testing Algorithm Reachability Mathematics Computing Academia
237	COMPUTING THE PARTITION FUNCTION FOR PERFECT MATCHINGS IN A HYPERGRAPH Alexander Barvinok and Alex Samorodnitsky September 2011 Abstract. Given non-negative weights wS on the k-subsets S of a km-element Add to Reading List Source URL: www.math.lsa.umich.edu Language: English - Date: 2011-09-04 21:59:49 Graph theory Mathematics Hypergraphs Bipartite graph Line graph Matching Graph factorization Permanent Line graph of a hypergraph Packing in a hypergraph
238	The CENTRE for EDUCATION in MATHEMATICS and COMPUTING News Release Add to Reading List Source URL: www.cemc.uwaterloo.ca Language: English - Date: 2010-02-18 08:28:46
239	The CENTRE for EDUCATION in MATHEMATICS and COMPUTING www.cemc.uwaterloo.ca Gauss Contest Grade 7 Add to Reading List Source URL: www.cemc.uwaterloo.ca Language: English - Date: 2012-06-08 13:48:30
240	Canadian Mathematics Competition An activity of the Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario Add to Reading List Source URL: www.cemc.uwaterloo.ca Language: English - Date: 2011-12-05 14:01:24

UPDATE